Stability of the feasible set for linear inequality systems: A carrier index set approach

Stability results for set solution of fuzzy integro-differential systems

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

stability results for set solution of fuzzy integro-differential systems

On the Stability of the Feasible Set in Optimization Problems

This paper provides stability theorems for the feasible set of optimization problems posed in locally convex topological vector spaces. The problems considered in this paper have an arbitrary number of inequality constraints and one constraint set. Di¤erent models are discussed, depending on the properties of the constraint functions (linear or not, convex or not, but at least lower semicontinu...

On Boundness Conditions for the Set of Feasible Points of Systems of Linear Inequalities

Abstract In a linear programming problem involving maximization (or minimization) of the objective function the set of feasible points is often required to be bounded above (or below). A criterion based on the simplex method which requires the constraints coefficients of the entering variable to be zero or negative for the set of feasible points to be unbounded is often used. In this paper, the...